Reasoning with Concrete Domains
نویسنده
چکیده
Description logics are formalisms for the represen tation of and reasoning about conceptual knowl edge on an abstract level. Concrete domains allow the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals, or spatial regions. The importance of this combined approach, especially for building real-world applications, is widely accepted. How ever, the complexity of reasoning with concrete do mains has never been formally analyzed and effi cient algorithms have not been developed. This pa per closes the gap by providing a tight bound for the complexity of reasoning with concrete domains and presenting optimal algorithms.
منابع مشابه
Reasoning in ALC with Fuzzy Concrete Domains
In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and predicates between them. For reasoning in the DL ALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete domains decidability can be regained. Typically, the concrete domain predicates are crisp, which is a limitati...
متن کاملThe Complexity of Reasoning with ConcreteDomainsCarsten
Description logics are knowledge representation and reasoning formalisms which represent conceptual knowledge on an abstract logical level. Concrete domains are a theoretically well-founded approach to the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals or spatial regions. In this paper, the complexity of combined reasoning with d...
متن کاملA Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension. So-called general concept inclusions (GCIs) play an important role for capturing background knowledge. It is well-known that, when combining concrete domains with GCIs, reasoning easily becomes undecidable. In this ...
متن کاملReasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predicates, such as ≤ or =. Until now, reasoning with concrete domains has been studied predominantly in the context of tableaux and automata calculi. In this paper, we present a general approach for concrete domain reasoni...
متن کاملDecidability of ALC(D) for concrete domains with the EHD-property
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. For particular, restricted concrete domains decidablity can be regained. We introduce a novel way to integrate a concrete domain D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions on D that guarantee decidability of the...
متن کامل